A mesh independent superlinear algorithm for some nonlinear nonsymmetric elliptic systems

نویسندگان

  • István Antal
  • János Karátson
چکیده

Nonlinear elliptic transport systems arise in various problems in applied mathematics, most often leading to large-scale problems owing to the huge number of equations, see e.g. [14, 17, 18]. For large-scale elliptic problems, iterative processes are the most widespread solution methods, which often rely on Hilbert space theory when mesh independence is desired. (See e.g. [7, 11, 12] and the authors’ papers [3, 10].) We consider elliptic transport systems with coupling in the nonlinear reaction terms, for which polynomial growth is allowed, and suitable coercivity is prescribed which can be naturally satisfied when the problem arises from time discretization of parabolic problems. We propose an outer-inner (damped inexact Newton plus PCG) iteration for the finite element discretization of the problem, and prove mesh independent superlinear convergence for both the outer and inner iterations. Numerical experiments strengthen our theoretical results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Superlinearly convergent PCG algorithms for some nonsymmetric elliptic systems

The conjugate gradient method is a widespread way of solving nonsymmetric linear algebraic systems, in particular for large systems arising from discretized elliptic problems. A celebrated property of the CGM is superlinear convergence, see the book [2] where a comprehensive summary is given on the convergence of the CGM. For discretized elliptic problems, the CGM is mostly used with suitable p...

متن کامل

Mesh Independent Superlinear PCG Rates Via Compact-Equivalent Operators

The subject of the paper is the mesh independent convergence of the preconditioned conjugate gradient method for nonsymmetric elliptic problems. The approach of equivalent operators is involved, in which one uses the discretization of another suitable elliptic operator as preconditioning matrix. By introducing the notion of compact-equivalent operators, it is proved that for a wide class of ell...

متن کامل

Superlinear PCG algorithms: symmetric part preconditioning and boundary conditions

The superlinear convergence of the preconditioned CGM is studied for nonsymmetric elliptic problems (convection-diffusion equations) with mixed boundary conditions. A mesh independent rate of superlinear convergence is given when symmetric part preconditioning is applied to the FEM discretizations of the BVP. This is the extension of a similar result of the author for Dirichlet problems. The di...

متن کامل

Domain Decomposition Algorithms for Indeenite Elliptic Problems

Iterative methods for linear systems of algebraic equations arising from the nite element discretization of nonsymmetric and indeenite elliptic problems are considered. Methods previously known to work well for positive deenite, symmetric problems are extended to certain nonsymmetric problems, which can also have some eigenvalues in the left half plane. We rst consider an additive Schwarz metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2008